A deterministic algorithm for inverting a polynomial matrix
نویسندگان
چکیده
منابع مشابه
A deterministic algorithm for inverting a polynomial matrix
Improved cost estimates are given for the problem of computing the inverse of an n×n matrix of univariate polynomials over a field. A deterministic algorithm is demonstrated that has worst case complexity (n3s) field operations, where s ≥ 1 is an upper bound for the average column degree of the input matrix. Here, the “+o(1)” in the exponent indicates a missing factor c1(log ns)2 for positive r...
متن کاملA New Recursive Algorithm For Inverting A General Comrade Matrix
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n). The algorithm is implementable to the Computer Algebra System (CAS) such as MAPLE, MATLAB and MATHEMATICA. Three examples are presented for the sake of illustration.
متن کاملA fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix
Given a square, nonsingular matrix of univariate polynomials F ∈ K[x] over a field K, we give a fast, deterministic algorithm for finding the Hermite normal form of F with complexity O (nωd) where d is the degree of F. Here soft-O notation is Big-O with log factors removed and ω is the exponent of matrix multiplication. The method relies of a fast algorithm for determining the diagonal entries ...
متن کاملA Deterministic and Polynomial Modified Perceptron Algorithm
We construct a modi ed perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn log n log(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modi ed perceptron algorithm running in time O(mn log n log(1/ρ)). 1 A Deter...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2015
ISSN: 0885-064X
DOI: 10.1016/j.jco.2014.09.004